Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets

نویسندگان

  • Paolo Baldan
  • Andrea Corradini
  • Hartmut Ehrig
  • Reiko Heckel
  • Barbara König
چکیده

We propose a framework for the specification of behaviour-preserving reconfigurations of systems modelled as Petri nets. The framework is based on open nets, a mild generalisation of ordinary Place/Transition nets suited to model open systems which might interact with the surrounding environment and endowed with a colimit-based composition operation. We show that natural notions of bisimilarity over open nets are congruences with respect to the composition operation. The considered behavioural equivalences differ for the choice of the observations, which can be single firings or parallel steps. Additionally, we consider weak forms of such equivalences, arising in the presence of unobservable actions. We also provide an up-to technique for facilitating bisimilarity proofs. The theory is used to identify suitable classes of reconfiguration rules (in the double-pushout approach to rewriting) whose application preserves the observational semantics of the net. 2000 ACM Subject Classification: F.3.1, F.4.2.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The decidability border of hereditary history preserving bisimilarity

In 2000 Jurdziński and Nielsen proved that hereditary history preserving bisimilarity (hhp-b) is undecidable for finite systems [7,8], and thereby resolved a long-standing open problem. The negative outcome contrasts the weaker history preserving bisimilarity (hp-b), for which decidability is well-established [15,6]. A definition of (h)hp-b on labelled 1-safe Petri nets (net systems) follows.

متن کامل

TINA – Construction of abstract state spaces for Petri nets and Time Petri nets

ion is proposed, preserving weak bisimilarity. The techniques proposed by Tina will be illustrated by Milner’s scheduler example (Milner 1985). The Petri net figure 2 represents the complete system (schedulerþ n sites): n sites cyclically execute action ai then action bi. A scheduler constrains the execution of the whole system in such a way that the n sites perform actions a1, a2, . . . , an i...

متن کامل

Partial Higher-dimensional Automata

We propose a generalization of higher-dimensional automata, partial HDA. Unlike HDA, and also extending event structures and Petri nets, partial HDA can model phenomena such as priorities or the disabling of an event by another event. Using open maps and unfoldings, we introduce a natural notion of (higher-dimensional) bisimilarity for partial HDA and relate it to history-preserving bisimilarit...

متن کامل

Completeness Results for Undecidable Bisimilarity Problems

We establish Σ11-completeness (in the analytical hierarchy) of weak bisimilarity checking for infinite-state processes generated by pushdown automata and parallel pushdown automata. The results imply Σ11-completeness of weak bisimilarity for Petri nets and give a negative answer to the open problem stated by Jančar (CAAP’95): “does the problem of weak bisimilarity for Petri nets belong to ∆11?”

متن کامل

On the Power of Labels in Transition Systems

In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled transition systems to unlabelled ones, preserving bisimilarity and satisfiability of μ-calculus formulas. We apply the reduction to the class of transition systems generated by Petri nets and pushdown automata, and obtain several...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Logical Methods in Computer Science

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2007